Optimizing Inner Product Masking Scheme by a Coding Theory Approach

نویسندگان

چکیده

Masking is one of the most popular countermeasures to protect cryptographic implementations against side-channel analysis since it provably secure and can be deployed at algorithm level. To strengthen original Boolean masking scheme, several works have suggested using schemes with high algebraic complexity. The Inner Product (IPM) those. In this paper, we propose a unified framework quantitatively assess security IPM in coding-theoretic approach. Specifically, starting from expression coded form, use two defining parameters code characterize its resistance. order validate framework, then connect leakage metrics (namely signal-to-noise ratio mutual information, an information-theoretic aspect) typical attack metric (success rate, practical build firm foundation for our framework. As application, results provide ultimate explanations on observations made by Balasch et al. EUROCRYPT'15 ASIACRYPT'17, Wang CARDIS'16 Poussier CARDIS'17 regarding parameter effects IPM, like higher bounded moment model. Furthermore, show how systematically choose optimal codes (in sense concrete level) optimize Eventually, present simple but effective choosing which special interest designers when selecting IPM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inner Product Masking Revisited

Masking is a popular countermeasure against side channel attacks. Many practical works use Boolean masking because of its simplicity, ease of implementation and comparably low performance overhead. Some recent works have explored masking schemes with higher algebraic complexity and have shown that they provide more security than Boolean masking at the cost of higher overheads. In particular, ma...

متن کامل

Consolidating Inner Product Masking

Masking schemes are a prominent countermeasure to defeat power analysis attacks. One of their core ingredients is the encoding function. Due to its simplicity and comparably low complexity overheads, many masking schemes are based on a Boolean encoding. Yet, several recent works have proposed masking schemes that are based on alternative encoding functions. One such example is the inner product...

متن کامل

Visual Pattern Image Coding by a Morphological Approach (RESEARCH NOTE)

This paper presents an improvement of the Visual Pattern image coding (VPIC) scheme presented by Chen and Bovik in [2] and [3]. The patterns in this improved scheme are defined by morphological operations and classified by absolute error minimization. The improved scheme identifies more uniform blocks and reduces the noise effect. Therefore, it improves the compression ratio and image quality i...

متن کامل

$C^{*}$-semi-inner product spaces

In this paper, we introduce a generalization of Hilbert $C^*$-modules which are pre-Finsler modules, namely, $C^{*}$-semi-inner product spaces. Some properties and results of such spaces are investigated, specially the orthogonality in these spaces will be considered. We then study bounded linear operators on $C^{*}$-semi-inner product spaces.

متن کامل

Theory and Practice of a Leakage Resilient Masking Scheme

A recent trend in cryptography is to formally prove the leakage resilience of cryptographic implementations – that is, one formally shows that a scheme remains provably secure even in the presence of side channel leakage. Although many of the proposed schemes are secure in a surprisingly strong model, most of them are unfortunately rather inefficient and come without practical security evaluati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Forensics and Security

سال: 2021

ISSN: ['1556-6013', '1556-6021']

DOI: https://doi.org/10.1109/tifs.2020.3009609